Section: New Results

Sharing Equality is Linear

Participants : Beniamino Accattoli, Andrea Condoluci, Claudio Sacerdoti Coen.

This work [28] studies how to compare higher-order programs with sharing for sharing equality, that is, for equality of their unshared underlying programs. The point, of course, is to do it efficiently, without unsharing the programs, that would otherwise introduce an exponential blow-up. We develop the first algorithm linear in the size of the shared terms, by adapting the famous Patterson and Wegman algorithm for first-order unification.